Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
نویسندگان
چکیده
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA), tabu search (TS) and genetic algorithms (GA)). Tabu search has been shown to produce the best quality solutions for two problems. In this paper this work is developed. A relatively new type of search algorithm (ant algorithm) is developed and the results from this algorithm are compared against SA, TS and GA. We discuss the ideas behind ant algorithms and describe how they have been implemented with regards to the nesting problem. The evaluation method used is described, as is the NFP. Computational results are given.
منابع مشابه
Applying Evolutionary Algorithms and the No Fit Polygon to the a Nesting Problem
In [6] solutions for the nesting problem are produced using the No Fit Polygon (NFP), simulated annealing (SA) and a new evaluation method. It showed that SA could out perform hill climbing, thus suggesting that evolutionary approaches produce better solutions than a standard search algorithm. In this paper this work is developed. Genetic algorithms (GA) and tabu search (TS) are compared with t...
متن کاملApplying Simulated Annealing and the No Fit Polygon to the Nesting Problem
This paper presents a new method to pack convex polygons into bins (the nesting problem). To do this polygons are placed in rows within bins using a metaheuristic algorithm (simulated annealing) and by utilising the No Fit Polygon. We show that simulated annealing out performs hill climbing. The nesting algorithm is described in detail, along with various aspects that have been incorporated in ...
متن کاملNo Fit Polygon for Nesting Problem Solving with Hybridizing Ant Algorithms
In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms research field, builds on the idea that the study of the behavior of ant colonies or other social insects is interesting, because it provides models of distributed organization whi...
متن کاملNew Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کامل